#include <iostream>
#include <deque>
using namespace std;

#include "Stack.h"
#include "Queue.h"

void text()
{
    bit1::stack<int> st;
    //bit::queue<int> qe;
    st.push(1);
    st.push(2);
    st.push(3);
    st.push(4);

    while (!st.empty())
    {
        cout << st.top()<<' ';
        st.pop();
    }
    cout << endl;
    bit2::queue<int> qe;
    qe.push(1);
    qe.push(2);
    qe.push(3);
    qe.push(4);

    while (!qe.empty())
    {
        cout << qe.front() << ' ';
        qe.pop();
    }
}

void text1()
{
    bit2::priority_queue<int> pq;
    pq.push(2);
    pq.push(4);
    pq.push(5);
    pq.push(3);
    pq.push(1);
    pq.push(6);
    pq.push(0);


    while (!pq.empty())
    {
        cout << pq.top() << ' ';
        pq.pop();
    }
    cout << endl;
}

int main()
{
	//text();
    text1();
    return 0;
}